Strong Completeness for Markovian Logics
نویسندگان
چکیده
In this paper we present Hilbert-style axiomatizations for three logics for reasoning about continuous-space Markov processes (MPs): (i) a logic for MPs defined for probability distributions on measurable state spaces, (ii) a logic for MPs defined for sub-probability distributions and (iii) a logic defined for arbitrary distributions. These logics are not compact so one needs infinitary rules in order to obtain strong completeness results. We propose a new infinitary rule that replaces the so-called Countable Additivity Rule (CAR) currently used in the literature to address the problem of proving strong completeness for these and similar logics. Unlike the CAR, our rule has a countable set of instances; consequently it allows us to apply the RasiowaSikorski lemma for establishing strong completeness. Our proof method is novel and it can be used for other logics as well.
منابع مشابه
Strong Completeness of Coalgebraic Modal Logics
Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, non-normal modal logics often present subtle difficulties – up to the point that canonical models may fail to exist, as is the case e.g. in most probabilistic logics. Here, we present a...
متن کاملHypercanonicity, Extensive Canonicity, Canonicity and Strong Completeness of Intermediate Propositional Logics
A b s t r a c t. Canonicity and strong completeness are well-established notions in the literature of intermediate propositional logics. Here we propose a more refined classification about canonicity distinguishing some subtypes of canonicity, we call hypercanonicity and extensive canonicity. We provide some semantical criteria for the classification of logics according to these notions and we ...
متن کاملLogic of Proofs with the Strong Provability Operator
Logics with the strong provability operator \: : : is true and provable" together with the proof operators \p is a proof of : : :" are axiomatized. Kripke-style completeness, decidability and arithmetical completeness of these logics are established.
متن کاملKleene Algebras, Regular Languages and Substructural Logics
We introduce the two substructural propositional logics KL, KL, which use disjunction, fusion and a unary, (quasi-)exponential connective. For both we prove strong completeness with respect to the interpretation in Kleene algebras and a variant thereof. We also prove strong completeness for language models, where each logic comes with a different interpretation. We show that for both logics the...
متن کاملStrong Completeness and the Finite Model Property for Bi-Intuitionistic Stable Tense Logics
Bi-Intuitionistic Stable Tense Logics (BIST Logics) are tense logics with a Kripke semantics where worlds in a frame are equipped with a pre-order as well as with an accessibility relation which is ‘stable’ with respect to this pre-order. BIST logics are extensions of a logic, BiSKt, which arose in the semantic context of hypergraphs, since a special case of the pre-order can represent the inci...
متن کامل